import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main {


    //笨小猴
    public static  boolean isprim(int n){
        if(n<2) return false;
        for (int i = 2; i <= Math.sqrt(n); i++) {
            if(n%i ==0 ) return false;
        }
        return true;
    }
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        char[] s = in.next().toCharArray();
        int[] hash = new int[26];
        for (int i = 0; i < s.length; i++) {
            hash[s[i]-'a']++;
        }
        int minn = 1000,maxn = 0;
        for (int i = 0; i < 26; i++) {
            if(hash[i] != 0){
                minn = Math.min(minn,hash[i]);
                maxn = Math.max(maxn,hash[i]);
            }
        }
        if(isprim(maxn - minn)){
            System.out.println("Luck Word");
            System.out.println(maxn - minn);
        }else{
            System.out.println("No Answer");
            System.out.println(0);
        }
    }



    //主持人调度（一）
    public boolean hostschedule (ArrayList<ArrayList<Integer>> sc) {
        int m = sc.size(),n=sc.get(0).size();
        int[][] schedule = new int [m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                schedule[i][j] = sc.get(i).get(j);
            }
        }
        Arrays.sort(schedule,(v1,v2)->{
            return v1[0]-v2[0];
        });
        for (int i = 1; i < schedule.length; i++) {
            if(schedule[i][0] < schedule[i-1][1]) return  false;
        }
        return true;

    }


    //分割等和子集
    public static int N = 510;
    public static int M = 510*110/2;
    public static int n;
    public static int[] arr = new int[N];
    public static boolean[][] dp = new boolean[N][M];
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        int sum=  0;
        for (int i = 1; i <= n; i++) {
            arr[i] = in.nextInt();
            sum+=arr[i];
        }
        if(sum%2 == 1) System.out.println("false");
        else{
            sum/=2;
            dp[0][0] = true;
            for (int i = 1; i <= n; i++) {
                for (int j = 0; j <=  sum; j++) {
                    dp[i][j] = dp[i-1][j];
                    if(j>=arr[i]){
                        dp[i][j] = dp[i][j] || dp[i-1][j-arr[i]];
                    }
                }
            }
            if(dp[n][sum]) System.out.println("true");
            else System.out.println("false");
        }

    }
}
